Complete complementary codes and generalized reed-muller codes

Generalized Reed-Muller Codes

the possible choices for n and k are rather thinly distributed in the class of all pairs (n, k) with k ~ n--and it is, therefore, often inefficient to make use of such codes in concrete situations (that is, when a desired pair (n, k) is far from any achievable pair). We have succeeded in overcoming this difficulty by generalizing the Reed-Muller codes in such a way that they exist for every pai...

Complete Mutually Orthogonal Golay Complementary Sets From Reed-Muller Codes

Recently Golay complementary sets were shown to exist in the subsets of second-order cosets of a q-ary generalization of the first-order Reed–Muller (RM) code. We show that mutually orthogonal Golay complementary sets can also be directly constructed from second-order cosets of a q-ary generalization of the first-order RM code. This identification can be used to construct zero correlation zone ...

Generalized State Realizations of Reed-Muller Codes

Generalized Reed-Muller codes over Galois rings

Recently, Bhaintwal and Wasan studied the Generalized Reed-Muller codes over the prime power integer residue ring. In this paper, we give a generalization of these codes to Generalized Reed-Muller codes over Galois rings.

Quantum Reed-Muller Codes

This paper presents a set of quantum Reed-Muller codes which are typically 100 times more effective than existing quantum Reed-Muller codes. The code parameters are [[n, k, d]] = [[2, ∑r l=0 C(m, l) − ∑m−r−1 l=0 C(m, l), 2 m−r ]] where 2r + 1 > m > r.